#include <iostream>
#include <string>
void answer(const std::string& x)
{
std::cout << x << '\n';
}
void no_answer()
{
std::cout << "Error occurred" << '\n';
}
bool parse(std::string_view& q, std::string& t)
{
if (!q.empty() && q[0] == ' ')
q.remove_prefix(1);
if (q.empty())
return false;
if (q[0] == 'i') {
q.remove_prefix(3);
t.append("int");
} else {
q.remove_prefix(4);
t.append("pair<");
if (!parse(q, t))
return false;
t.push_back(',');
if (!parse(q, t))
return false;
t.push_back('>');
}
return true;
}
void solve(size_t n, const std::string& s)
{
std::string t;
std::string_view q = s;
parse(q, t) && q.empty() ? answer(t) : no_answer();
}
int main()
{
std::cin.tie(nullptr)->sync_with_stdio(false);
size_t n;
std::cin >> n >> std::ws;
std::string s;
std::getline(std::cin, s);
solve(n, s);
return 0;
}
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |